Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Clock synchronization algorithm based on component decoupling fusion for wireless sensor networks
SHI Xin ZHAO Xiangmo HUI Fei YANG Lan
Journal of Computer Applications    2014, 34 (3): 623-627.   DOI: 10.11772/j.issn.1001-9081.2014.03.0623
Abstract478)      PDF (752KB)(409)       Save

Improving sync accuracy in Wireless Sensor Network (WSN) usually causes additional sync overhead. To optimize the compatibility of higher sync accuracy and lower sync overhead, a time sync algorithm based on the component decoupling fusion was proposed. With the two-way broadcast sync mechanism and the clock correlations, the clock deviations between synchronized nodes and reference nodes were estimated by the component decoupling fusion. Besides, the computation for the weights of different components was discussed according to the linear unbiased minimum variance estimation. The simulation results show that, without the additional energy consumption, the proposed algorithm can improve its sync accuracy after 20 sync rounds by 4.52μs, 13.8μs and 25.48μs, compared to PBS (Pairwise Broadcast Synchronization), TPSN (Timing-sync Protocol for Sensor Network) and RBS (Reference Broadcast Sync) respectively.

Related Articles | Metrics
Method of Boolean operation based on 3D grid model
CHEN Xuegong YANG Lan HUANG Wei JI Xing
Journal of Computer Applications    2011, 31 (06): 1543-1545.   DOI: 10.3724/SP.J.1087.2011.01543
Abstract2168)      PDF (644KB)(518)       Save
A kind of Boolean operational method based on a three-dimensional grid model was proposed. Firstly, through collision detection algorithm based on hierarchical bounding box tree of Oriented Bounding Box (ORB), the intersecting triangles could be got. Through the intersection test of the triangles, the intersecting lines could be obtained and the intersecting lines topology relations with the triangles could be established. Secondly, a regional division for the intersecting triangles was made through processing the three types of intersecting lines, so as to get a series of polygons, and carry out Delaunay triangulations for polygon to get the result area. Lastly, relation adjacency list was constructed based on solid containing relations, the polygons internal relation and external relation with other entities were judged, and the triangles were located according to the mesh model topology relations. Simultaneously, according to such Boolean operations as the intersection, union, and differences, according to the grid model topology relations were judged, the position of the triangles were judged and then the final results could be obtained. Experimental results show that this algorithm can achieve better results. Experimental results show that the lithology of intersecting parts is consistent with the entities and can verify the correctness and feasibility of the algorithm.
Related Articles | Metrics